منابع مشابه
Projected Products of Polygons
in conjunction with Euler’s formula, f1 = f0 + f2 − 2; see also [6, Sect. 10.3]. Moreover, the cone of flag vectors of 3-polytopes is also given by these two inequalities, together with the usual Dehn– Sommerville relations, such as f02 = 2f1 and f012 = 4f1. Here the extreme cases, polytopes whose f or flag vectors lie at the boundary of the cone, are given by the simplicial polytopes (for whic...
متن کاملOn the Combinatorics of Projected Deformed Products
Die selbstständige und eigenhändige Anfertigung versichere ich an Eides statt. To my father who introduced me to computers and maths and to my mother who failed to prevent him.
متن کاملConstruction and Analysis of Projected Deformed Products
We introduce a deformed product construction for simple polytopes in terms of lowertriangular block matrix representations. We further show how Gale duality can be employed for the construction and for the analysis of deformed products such that specified faces (e.g. all the k-faces) are “strictly preserved” under projection. Thus, starting from an arbitrary neighborly simplicial (d−2)-polytope...
متن کاملOn Minimal Triangulations of Products of Convex Polygons
We give new lower bounds for the minimal number of simplices needed in a triangulation of the product of two convex polygons, improving the lower bounds in [Bo&al05].
متن کاملLogic Synthesis of EXOR Projected Sum of Products
We define a new algebraic form for Boolean function representation, called EXOR-Projected Sum of Products (EP-SOP), consisting in a four level network that can be easily implemented in practice. Deriving an optimal EP-SOP from an optimal SOP form is a NP NP -hard problem; nevertheless we propose a very efficient approximation algorithm, which returns, in polynomial time, an EP-SOP form whose co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Research Announcements of the American Mathematical Society
سال: 2004
ISSN: 1079-6762
DOI: 10.1090/s1079-6762-04-00137-4